Climate policies under climate model uncertainty: Max-min and min-max regret
نویسندگان
چکیده
منابع مشابه
Min-max and min-max regret versions of some combinatorial optimization problems: a survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also inv...
متن کاملApproximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملMin-max and min-max regret versions of combinatorial optimization problems: A survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP -hard, we...
متن کاملComplexity of the min-max and min-max regret assignment problems
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP -hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP -hard.
متن کاملPseudo-polynomial algorithms for min-max and min-max regret problems?
We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regret versions of some polynomial or pseudo-polynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudo-polynomial algorithms for the min-max and and min-max regret versions of several classical problems includ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Economics
سال: 2017
ISSN: 0140-9883
DOI: 10.1016/j.eneco.2017.10.018